Linear programming relaxation - PDFSEARCH.IO - Document Search Engine

Linear programming relaxation
Results: 230

#	Item
201	Unit 1 Linear Programming Lesson 2: Introduction to linear programming And Add to Reading List Source URL: businessmanagementcourses.org Language: English - Date: 2007-06-08 11:36:47 Applied mathematics Linear programming Goal programming Mathematical model Dynamic programming Multi-objective optimization Linear programming relaxation Operations research Mathematical optimization Mathematics
202	Set-Membership Identification of Block-Structured Nonlinear Feedback Systems Add to Reading List Source URL: diegoregruto.com Language: English - Date: 2010-04-12 10:45:58 Science Mathematical sciences Linear matrix inequality Relaxation Errors-in-variables models Control theory Mathematical model Linear system Linear programming Mathematics Mathematical optimization Operations research
203	Curriculum Vitae: Mohit Tawarmalani Krannert School of Management Purdue University 100 S. Grant West Lafayette, IN[removed] Add to Reading List Source URL: web.ics.purdue.edu Language: English - Date: 2014-04-07 20:38:29 Linear programming Relaxation BARON Quadratically constrained quadratic program Cutting-plane method Nonlinear programming Global optimization Convex optimization Quadratic programming Mathematical optimization Numerical analysis Mathematical analysis
204	An Accelerated Gradient Method for Distributed Multi-Agent Planning with Factored MDPs Geoffrey J. Gordon Machine Learning Department Carnegie Mellon University Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-11-28 10:53:32 Convex optimization Operations research Linear programming Gradient descent Duality Interior point method Lagrangian relaxation Reinforcement learning Markov decision process Mathematical optimization Numerical analysis Mathematical analysis
205	Lagrangian Relaxation for Large-Scale Multi-Agent Planning Geoffrey J. Gordon† , Pradeep Varakantham‡ , William Yeoh∗ , Hoong Chuin Lau‡ , Ajay S. Aravamudhan‡ and Shih-Fen Cheng‡ † Machine Learning Departm Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2013-03-07 09:00:10 Convex optimization Lagrangian relaxation Lagrange multiplier Relaxation Linear programming Mathematical optimization Mathematical analysis Duality
206	Strengthening Landmark Heuristics via Hitting Sets Blai Bonet1 and Malte Helmert2 Abstract. The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heu Add to Reading List Source URL: www2.informatik.uni-freiburg.de Language: English - Date: 2010-05-29 10:18:47 Combinatorial optimization Mathematics Applied mathematics Heuristic function Admissible heuristic Heuristic Branch and bound Linear programming relaxation Relaxation Mathematical optimization Heuristics Operations research
207	IEEE TRANS. ON CONTROL OF NETWORK SYSTEMS, JUNE[removed]WITH PROOFS) 1 Convex Relaxation of Optimal Power Flow Part II: Exactness Add to Reading List Source URL: netlab.caltech.edu Language: English - Date: 2014-05-06 00:32:56 Linear programming Mathematics Applied mathematics Second-order cone programming Relaxation Semidefinite programming Duality Mathematical sciences Mathematical optimization Operations research Convex optimization
208	IEEE TRANS. ON CONTROL OF NETWORK SYSTEMS, 1(1):15–27, MARCH[removed]WITH PROOFS) 1 Convex Relaxation of Optimal Power Flow Part I: Formulations and Equivalence Add to Reading List Source URL: netlab.caltech.edu Language: English - Date: 2014-05-06 00:32:33 Convex optimization Linear programming Relaxation Power flow study Applied mathematics Mathematics Matrix Physics Operations research Electric power Mathematical optimization
209	Approximating NP-hard Problems Efficient Algorithms and their Limits Prasad Raghavendra A dissertation submitted in partial fulfillment Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2009-10-30 11:58:51 Mathematical optimization Linear programming Computational complexity theory Combinatorial optimization Operations research Semidefinite programming Linear programming relaxation Relaxation Constraint satisfaction problem Theoretical computer science Mathematics Applied mathematics
210	Better Guarantees for Sparsest Cut Clustering Maria-Florina Balcan Microsoft Research, New England One Memorial Drive, Cambridge, MA [removed] Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-05-22 14:29:08 Computational statistics Cut Graph connectivity K-means clustering K-medians clustering Approximation algorithm Linear programming relaxation K-means++ Cluster analysis Statistics Mathematics Combinatorial optimization

UPDATE